Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
121	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Mathematical optimization Job shop scheduling Operations research Structural complexity theory Metric k-center Algorithm Dominating set NP Theoretical computer science Computational complexity theory Mathematics
122	Inapproximability of Dominating Set in Power Law Graphs Mikael Gast∗ Mathias Hauptmann† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-12-17 05:08:30 Applied mathematics Differences between codices Sinaiticus and Vaticanus Isotope lists 49-72 Mathematics Dominating set Net
123	Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations Mikael Gast∗ Mathias Hauptmann† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-12-14 10:41:01 Applied mathematics Multigraph Independent set Dominating set Theoretical computer science NP-complete problems Mathematics
124	GeneratingAndEnumeratingDigitallyConvexSetsNov18_2013.dvi Add to Reading List Source URL: ion.uwinnipeg.ca Language: English - Date: 2014-05-21 15:59:07 Geometry Convex function Convex hull Convex set Dominating set Geodesic convexity Connectivity Convex bipartite graph Convex analysis Mathematics Mathematical analysis
125	Fault-Tolerant Clustering in Ad Hoc and Sensor Networks Fabian Kuhn Microsoft Research Silicon Valley 1065 La Avenida Mountain View, CA[removed]removed] Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2006-04-05 09:53:00 Binary trees NP-complete problems Dominating set Randomized rounding Randomized algorithm Rope David Shmoys Tango tree Theoretical computer science Computational complexity theory Mathematics
126	Distrib. Comput[removed]: 303–310 Digital Object Identiﬁer (DOI[removed]s00446[removed]Constant-time distributed dominating set approximation Fabian Kuhn, Roger Wattenhofer Computer Engineering and Networks La Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-11-03 04:38:57 NP-complete problems Dominating set Algorithm Randomized rounding Connected dominating set Mathematics Theoretical computer science Applied mathematics
127	On the Locality of Bounded Growth Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-05-19 08:04:24 NP-complete problems Graph coloring Search algorithms Connectivity Unit disk graph Nearest neighbor search Distributed computing Connected component Dominating set Theoretical computer science Graph theory Mathematics
128	Local Approximation Schemes for Ad Hoc and Sensor ∗ Networks Fabian Kuhn Thomas Moscibroda Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-23 16:10:38 NP-complete problems Dominating set Unit disk graph Connected dominating set Graph coloring Independent set Polynomial-time approximation scheme Bidimensionality Domatic number Graph theory Theoretical computer science Computational complexity theory
129	CS 170 Fall 2006 — Discussion Handout #9 November 30, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-12-10 01:57:12 NP-complete problems Graph coloring Dominating set NP-complete Chromatic polynomial Graph theory Theoretical computer science Mathematics
130	CS 170 Fall 2006 — Discussion Handout #10 December 10, 2006 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2006-12-10 19:32:36 Spanning tree NP-complete problems Graph connectivity Minimum spanning tree Steiner tree problem Tree Connectivity Cut Connected dominating set Graph theory Theoretical computer science Mathematics